Sorting and Searching on the Word RAM
نویسنده
چکیده
Exercise 1 (page 378, line 5) Describe in your own words how the operations lookup, min, max, succ, pred are carried out, and what the time complexity is. Exercise 2 (page 379, line -8) Describe how the operations lookup, min, max, succ, pred, insert, delete are carried out using constant time and one operation in . Exercise 3 (page 381, line 13) Prove that multiplying X by 1 2 f 1 creates the desired mask from the test bits in X .
منابع مشابه
Faster Deterministic Sorting and Searching in Linear Space
We present a significant improvement on linear space deterministic sorting and searching. On a unit-cost RAM with word size w, an ordered set of nw-bit keys (viewed as binary strings or integers) can be maintained in
متن کاملAn Experimental Study of Word-level Parallelism in Some Sorting Algorithms
A number of algorithms for fundamental problems such as sorting, searching, priority queues and shortest paths have been proposed recently for the unit-cost RAM with word size w. These algorithms ooer dramatic (asymptotic) speedups over classical approaches to these problems. We describe some preliminary steps we have taken towards a systematic evaluation of the practical performance of these a...
متن کاملFaster Deterministic Sorting and Searching in Linear Space Tech. Report Lu{cs{tr:95{160
We present a signiicant improvement on linear space deterministic sorting and searching. On a unit-cost RAM with word size w, an ordered set of n w-bit keys (viewed as binary strings or integers) can be maintained in O min p log n; log n log w + log logn; logw log logn time per operation, including insert, delete, member search, and neighbour search. The cost for searching is worst-case while t...
متن کاملAlgorithms in the Ultra-Wide Word Model
The effective use of parallel computing resources to speed up algorithms in current multicore and other parallel architectures remains a difficult challenge, with ease of programming playing a key role in the eventual success of these architectures. In this paper we consider an alternative view of parallelism in the form of an ultra-wide word processor. We introduce the Ultra-Wide Word architec...
متن کاملRevisiting Visibility in the Plane
We consider two closely related problems: computing the region visible from a point amid simple polygonal obstacles and computing the lower envelope of a set of disjoint segments. Visibility problems such as these were proposed and promptly solved in the late ’80s and early ’90s before the widespread popularity of the word RAM model. All previously published algorithms thus run in Ω(n log n) ti...
متن کامل